منابع مشابه
Symbolic Tree Transducers
Symbolic transducers are useful in the context of web security as they form the foundation for sanitization of potentially malicious data. We define Symbolic Tree Transducers as a generalization of Regular Transducers as finite state input-output tree automata with logical constraints over a parametric background theory. We examine key closure properties of Symbolic Tree Transducers and we deve...
متن کاملIterated relabeling tree transducers
In this paper we consider the closure UCI(Rel) of the class of relabeling tree transformations, under U=union, C=composition and I=iteration. We give a characterization of UCI(Rel) in terms of a short expression built up from Rel with composition and iteration. We also give a characterization of UCI(Rel) in terms of one-step rewrite relations of very simple term rewrite systems. We give a simil...
متن کاملMacro Tree Transducers
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. ...
متن کاملWeighted Extended Tree Transducers
The rst systematic treatment of weighted extended tree transducers (wxtt) over countably complete semirings is provided. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of weighted tree transformations computed by bottomup wxtt in terms of bimorphisms is provided. Back...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00135-8